Logical fragments for Mazurkiewicz traces: expressive power and algebraic characterizations
نویسنده
چکیده
Acknowledgments First and foremost, I would like to thank my supervisor Volker Diekert for his continual motivation and support over all my years in his group. He recommended the topic of this thesis to me and provided valuable guidance and advice. Furthermore I would like to thank Ulrich Hertrampf and Pascal Weil. I also wish to express my gratitude to Holger Austinat, Martin Horsch, Mar-tin Müller and Pascal Tesson for many interesting discussions on topics of this thesis. Last but not least I want to thank all members our department for a very pleasant and likeable ambience.
منابع مشابه
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic and first-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical properties can be described by rather simple logical formulas one is interested in logical fragments. One focus of this paper is unary temporal logic and first-order logic in two variables. Over words, this correspo...
متن کاملOn First-Order Fragments for Words and Mazurkiewicz Traces A Survey
We summarize several characterizations, inclusions, and separations on fragments of first-order logic over words and Mazurkiewicz traces. The results concerning Mazurkiewicz traces can be seen as generalizations of those for words. It turns out that over traces it is crucial, how easy concurrency can be expressed. Since there is no concurrency in words, this distinction does not occur there. In...
متن کاملPolynomials, Fragments of Temporal Logic and the Variety DA over Traces
We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To this aim we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces. We also show that there exist natural fragments of local...
متن کاملAn Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the co...
متن کاملElements of an automata theory over partial orders
A model of nondeterministic nite automaton over ((nite) partial orders is introduced. It captures existential monadic second-order logic in expressive power and generalizes classical word automata and tree automata. Special forms, such as deterministic automata, are discussed, and logical and algorithmic properties are analyzed, like closure under complement and decid-ability of the nonemptines...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006